A Distributed Algorithm for Optimal Concurrent Communication and Load Balancing in Parallel Systems (In: High-Performance Computing and Networking HPCN'97, Spinger LNCS)
نویسندگان
چکیده
We present a distributed algorithm for determining optimal concurrent communication ow in arbitrary computer networks. Our scheme is applicable to a wide range of network ow applications in computer science and operations research. As an example, it can be used for determining optimal task migration paths in metacomputing environments, or for work-load balancing in arbitrary heterogeneous computer networks.
منابع مشابه
A Distributed Algorithm for Optimal Concurrent Communication and Load Balancing in Parallel Systems
We present a distributed algorithm for determining optimal concurrent communication ow in arbitrary computer networks. Our scheme is applicable to a wide range of network ow applications in computer science and operations research. As an example, it can be used for determining optimal task migration paths in metacomputing environments, or for work-load balancing in arbitrary heterogeneous compu...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملGreen Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملScalable Monte Carlo Image Synthesis
This paper describes a scalable photorealistic renderer that is designed to render scenes of arbitrary complexity on computer systems of arbitrary size. The rendering algorithm is a Monte Carlo method to compute approximate solutions of the rendering equation. The software implementation uses a diiusive load balancing method coupled with a message driven concurrent pipeline. Measured performanc...
متن کاملAn Adaptive Curvilinear-Coordinate Approach to Dynamic Load Balancing of Parallel Multiresolution Molecular Dynamics
We present a practical experience in adding a dynamic-load-balancing capability to an existing large parallel application multiresolution molecular dynamics (MRMD) which is based on uniform mesh decomposition. The new load-balancing scheme uses adaptive curvilinear ccordinates to represent partition boundaries. Workloads are partitioned with a uniform 3-dimensional mesh in the curvilinear coord...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997